On the Power of Arrays with Recon gurable Optical Buses

نویسندگان

  • Sandy Pavel
  • Selim G. Akl
چکیده

This paper examines some computational aspects of di erent arrays enhanced with optical pipelined buses. The array processors with optical pipelined buses (APPB) are shown to be extremely exible, as demonstrated by their ability to e ciently simulate di erent variants of PRAMs and bounded degree networks. A model of computation is introduced, the array with recon gurable optical buses (AROB), which combines some of the advantages and characteristics of the classical recon gurable networks (RN) and the APPB. A number of applications of the APPB and AROB are presented, and their power is investigated. It is shown that beside AROB's capability of simulating classical recon gurable networks, the enhanced communication mechanisms allow for an important system reduction when compared with the classical RNs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving graph theory problems using recon®gurable pipelined optical buses

We solve a number of important and interesting problems from graph theory on a linear array with a recon®gurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value ®nding algorithms, and are currently the fastest algorithms. We also distinguish the two cases where weights have bounded/unbounded magnitude and precision. Ó 2000 Published by Else...

متن کامل

Fast and Scalable Parallel Matrix Computations with Optical Buses

We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with recon gurable pipelined optical bus systems. These problems include computing the Nth power, the inverse, the characteristic polynomial, the determinant, the rank, and an LUand a QR-factorization of a matrix, and solving linear systems of equations. These com...

متن کامل

Optimal Algorithms for Constrained Recon gurable Meshes

This paper introduces a constrained recon gurable mesh model which incorporates practical assump tions about propagation delays on large sized buses Simulations of optimal recon gurable mesh algo rithms on the constrained recon gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems are then presented For the problems investigated the con strain...

متن کامل

Optimal Algorithms for Constrained Reconfigurable Meshes

This paper introduces a constrained recon gurable mesh model which incorpo rates practical assumptions about propagation delays on large sized buses Sim ulations of AT optimal recon gurable mesh algorithms on the constrained re con gurable mesh model are found to be non optimal Optimal solutions for the sorting and convex hull problems requiring less area are then presented For the problems inv...

متن کامل

Constant Time Algorithms for Computing the Contour of Maximal Elements on the Recon gurable Mesh

Elements on the Recon gurable Mesh M. Manzur Murshed and Richard P. Brent Computer Sciences Lab, Research School of Information Sciences & Engg. The Australian National University, Canberra ACT 0200, Australia E-mail: fmurshed,[email protected] Abstract There has recently been an interest in the introduction of recon gurable buses to existing parallel architectures. Among them Recon gurable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995